A Data-Parallel Implementation of Hierarchical N-Body Methods
نویسندگان
چکیده
The O(N) hierarchical N{body algorithms and Massively Parallel Processors allow particle systems of 100 million particles or more to be simulated in acceptable time. We describe a data parallel implementation of Anderson's method and demonstrate both eeciency and scalability of the implementation on the Connection Machine CM{5/5E systems. The communication time for large particle systems amounts to about 10{25%, and the overall eeciency is about 35%. On a CM{5E the overall performance is about 60 MMop/s per node, independent of the number of nodes.
منابع مشابه
Efficient Data Parallel Implementations of Highly Irregular Problems
This dissertation presents optimization techniques for efficient data parallel formulation/implementation of highly irregular problems, and applies the techniques to O(N) hierarchical N–body methods for large–scale N–body simulations. It demonstrates that highly irregular scientific and engineering problems such as nonadaptive and adaptive O(N) hierarchical N–body methods can be efficiently imp...
متن کاملEfficient Parallel Algorithms and Software for Compressed Octrees with Applications to Hierarchical Methods
We describe the design and implementation of efficient parallel algorithms, and a software library for the parallel implementation of compressed octree data structures. Octrees are widely used in supporting hierarchical methods for scientific applications such as the N-body problem, molecular dynamics and smoothed particle hydrodynamics. The primary goal of our work is to identify and abstract ...
متن کاملDesign and Evaluation of a Parallel HOP Clustering Algorithm for Cosmological Simulation
Clustering, or unsupervised classification, has many uses in fields that depend on grouping results from large amount of data, an example being the N-body cosmological simulation in astrophysics. In this paper, we study a particular clustering algorithm used in astrophysics, called HOP, and present a parallel implementation to speed up its current sequential implementation. Our approach first b...
متن کاملParallel multigrid summation for the N-body problem
An Θ(n) parallel multigrid summation method for the N -body problem is presented. The method works with vacuum or periodic boundary conditions. It is based on a hierarchical decomposition of computational kernels on multiple grids. For low accuracy calculations, appropriate for molecular dynamics, a sequential implementation is faster than both Fast Multipole and Particle Mesh Ewald (PME). Its ...
متن کاملImplementation of the direction of arrival estimation algorithms by means of GPU-parallel processing in the Kuda environment (Research Article)
Direction-of-arrival (DOA) estimation of audio signals is critical in different areas, including electronic war, sonar, etc. The beamforming methods like Minimum Variance Distortionless Response (MVDR), Delay-and-Sum (DAS), and subspace-based Multiple Signal Classification (MUSIC) are the most known DOA estimation techniques. The mentioned methods have high computational complexity. Hence using...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJHPCA
دوره 10 شماره
صفحات -
تاریخ انتشار 1996